Forbidden Hypermatrices Imply General Bounds on Induced Forbidden Subposet Problems
نویسندگان
چکیده
منابع مشابه
Induced and Non-induced Forbidden Subposet Problems
The problem of determining the maximum size La(n, P ) that a P -free subposet of the Boolean lattice Bn can have, attracted the attention of many researchers, but little is known about the induced version of these problems. In this paper we determine the asymptotic behavior of La∗(n, P ), the maximum size that an induced P -free subposet of the Boolean lattice Bn can have for the case when P is...
متن کاملSupersaturation and stability for forbidden subposet problems
We address a supersaturation problem in the context of forbidden subposets. A family F of sets is said to contain the poset P if there is an injection i : P → F such that p ≤P q implies i(p) ⊂ i(q). The poset on four elements a, b, c, d with a, b ≤ c, d is called a butterfly. The maximum size of a family F ⊆ 2 that does not contain a butterfly is ( n bn/2c ) + ( n bn/2c+1 ) as proved by De Boni...
متن کاملSet Families with a Forbidden Subposet
We asymptotically determine the size of the largest family F of subsets of {1, . . . , n} not containing a given poset P if the Hasse diagram of P is a tree. This is a qualitative generalization of several known results including Sperner’s theorem. Introduction We say that a poset P is a subposet of a poset P ′ if there is an injective map f : P → P ′ such that a 6P b implies f(a) 6P ′ f(b). A ...
متن کاملOn Families of Subsets With a Forbidden Subposet
Let F ⊂ 2[n] be a family of subsets of {1, 2, . . . , n}. For any poset H, we say F is H-free if F does not contain any subposet isomorphic to H. Katona and others have investigated the behavior of La(n,H), which denotes the maximum size of H-free families F ⊂ 2[n]. Here we use a new approach, which is to apply methods from extremal graph theory and probability theory to identify new classes of...
متن کاملExtremal problems for forbidden pairs that imply hamiltonicity
Let C denote the claw K1,3, N the net (a graph obtained from a K3 by attaching a disjoint edge to each vertex of the K3), W the wounded (a graph obtained from a K3 by attaching an edge to one vertex and a disjoint path P3 to a second vertex), and Zi the graph consisting of a K3 with a path of length i attached to one vertex. For k a fixed positive integer and n a sufficiently large integer, the...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Combinatorics, Probability and Computing
سال: 2017
ISSN: 0963-5483,1469-2163
DOI: 10.1017/s0963548317000013